翻訳と辞書 Words near each other ・ Vehicle registration plates of Washington (state) ・ Vehicle registration plates of Washington, D.C. ・ Vehicle registration plates of West Azerbaijan ・ Vehicle registration plates of West Virginia ・ Vehicle registration plates of Wisconsin ・ Vehicle registration plates of Wyoming ・ Vehicle registration plates of Yazd ・ Vehicle registration plates of Yemen ・ Vehicle registration plates of Yugoslavia ・ Vehicle registration plates of Yukon ・ Vehicle registration plates of Zanjan ・ Vehicle registration plates of Zimbabwe ・ Vehicle registration tax (Ireland) ・ Vehicle regulation ・ Vehicle remarketing ・ Vehicle rescheduling problem ・ Vehicle Research and Development Establishment ・ Vehicle restoration ・ Vehicle routing problem ・ Vehicle safety technology ・ Vehicle scrappage scheme ・ Vehicle setup ・ Vehicle simulation game ・ Vehicle simulations ・ Vehicle size class ・ Vehicle snorkel ・ Vehicle Theft Protection Program ・ Vehicle title ・ Vehicle title branding ・ Vehicle tracking system Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Vehicle rescheduling problem ： ウィキペディア英語版 Vehicle rescheduling problem The Vehicle rescheduling problem (VRSP) is a combinatorial optimization and integer programming problem seeking to service customers on a trip after change of schedule such as vehicle break down or major delay. The problem of reassigning vehicles in real-time to this cut trip as well as to other scheduled trips with given starting and ending times, while minimising operating and delay cost, is referred to as the Vehicle Rescheduling Problem (VRSP). Proposed by Li, Mirchandani and Borenstein in 2007, VSRP is an important problem in the fields of transportation and logistics. Determining the optimal solution is an NP-complete problem in combinatorial optimization, so in practice heuristic and deterministic methods are used to find acceptably good solutions for the VRSP. == Overview == Several variations and specializations of the vehicle rescheduling problem exist: * Single Depot Vehicle Rescheduling Problem (SDVRSP): A number of trips need to be rescheduled due to delay, vehicle break down or for any other reason. The goal is to find optimal rescheduling of the existing fleet, using possibly extra vehicles from the depot, in order to minimise the delay and the operating costs. In the Single Depot variation, there is only one depot which contains all extra vehicles, and in which every vehicle starts and ends its schedule. * Multi Depot Vehicle Rescheduling Problem (MDVRSP): Similar to SDVRSP, except additional depots are introduced. Each depot has capacity constraints, as well as variable extra vehicles. Usually vehicle schedules have an additional constraint which requires that each vehicle returns to the depot where it started its schedule. * Open Vehicle Rescheduling Problem (OVRSP): Vehicles are not required to return to the depot. Although VRSP is related to the Single Depot Vehicle Scheduling Problem and the Multi Depot Vehicle Scheduling Problem, there is a significant difference in runtime requirements, as VRSP need to be solved in near real-time to allow rescheduling during operations, while SDVSP and MDVSP are typically solved using long running linear programming methods. Another field where VRSP is used is in transportation of goods in order to reschedule the routes when demand substantially changes 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Vehicle rescheduling problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.